An efficient and optimal algorithm for simultaneous buffer and wire sizing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient and optimal algorithm for simultaneous buffer and wire sizing

In this paper, we consider the problem of interconnect delay minimization by simultaneous buffer and wire sizing under the Elmore delay model. We first present a polynomial time algorithm SBWS to minimize the delay of an interconnect wire. Previously, no polynomial time algorithm for the problem has been reported in the literature. SBWS is an iterative algorithm with guaranteed convergence to t...

متن کامل

Power-optimal Simultaneous Buffer Insertion/sizing and Wire Sizing

This paper studies the problems of minimizing power dissipation of an interconnect wire by simultaneously considering buffer insertion/sizing and wire sizing (BISWS). We consider two cases, namely minimizing power dissipation with optimal delay constraints, and minimizing power dissipation with a given delay penalty. We derive closed form optimal solutions for both cases. These closed form solu...

متن کامل

A Polynomial Time Optimal Algorithm for Simultaneous Bu er and Wire Sizing

An interconnect joining a source and a sink is divided into xed length uniform width wire segments and some adjacent segments have bu ers in between The problem we considered is to simultaneously size the bu ers and the segments so that the Elmore delay from the source to the sink is minimized Previously no polynomial time al gorithm for the problem has been reported in literature In this paper...

متن کامل

A quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing

In this paper, we present a completely new approach to the problem of delay minimization by simultaneous buffer insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we explore some special properties of our problem and derive an optimal and very efficient algorithm modified...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 1999

ISSN: 0278-0070

DOI: 10.1109/43.784121